Matching Pursuit Kernel Fisher Discriminant Analysis
نویسندگان
چکیده
We derive a novel sparse version of Kernel Fisher Discriminant Analysis (KFDA) using an approach based on Matching Pursuit (MP). We call this algorithm Matching Pursuit Kernel Fisher Discriminant Analysis (MPKFDA). We provide generalisation error bounds analogous to those constructed for the Robust Minimax algorithm together with a sample compression bounding technique. We present experimental results on real world datasets, which show that MPKFDA is competitive with the KFDA and the SVM on UCI datasets, and additional experiments that show that the MPKFDA on average outperforms KFDA and SVM in extremely high dimensional settings.
منابع مشابه
Kernel matching pursuit for large datasets
Kernel Matching Pursuit is a greedy algorithm for building an approximation of a discriminant function as a linear combination of some basis functions selected from a kernel–induced dictionary. Here we propose a modification of the Kernel Matching Pursuit algorithm that aims at making the method practical for large datasets. Starting from an approximating algorithm, the Weak Greedy Algorithm, w...
متن کاملAdaptive Quasiconformal Kernel Fisher Discriminant Analysis via Weighted Maximum Margin Criterion
Kernel Fisher discriminant analysis (KFD) is an effective method to extract nonlinear discriminant features of input data using the kernel trick. However, conventional KFD algorithms endure the kernel selection problem as well as the singular problem. In order to overcome these limitations, a novel nonlinear feature extraction method called adaptive quasiconformal kernel Fisher discriminant ana...
متن کاملRecognition of Expressions Based on Kernel Global and Local Symmetrical Weighted Fisher Discriminant Nonlinear Subspace Approach
Preservation of global and local features of images during dimensional reduction is a challenging task. The main goal of this work is to resolve the problem of singularity matrix by preserving local and global discriminative features by introducing symmetrical weights on principal components. To meet this goal Combinational Entire Gabor Kernel Global and Locality Preserving Symmetrical Weighted...
متن کاملError bounds for Kernel Fisher Linear Discriminant in Gaussian Hilbert space
We give a non-trivial, non-asymptotic upper bound on the classification error of the popular Kernel Fisher Linear Discriminant classifier under the assumption that the kernelinduced space is a Gaussian Hilbert space.
متن کاملRapid and Brief Communication A reformative kernel Fisher discriminant analysis
A reformative kernel Fisher discriminant method is proposed, which is directly derived from the naive kernel Fisher discriminant analysis with superiority in classi1cation e2ciency. In the novel method only a part of training patterns, called “signi1cant nodes”, are necessary to be adopted in classifying one test pattern. A recursive algorithm for selecting “signi1cant nodes”, which is the key ...
متن کامل